Computational Methods in an Algebra of Regular Hedge Expressions
نویسندگان
چکیده
We propose an algebra of regular hedge expressions built on top of regular hedge grammars as a framework for the analysis and manipulation of hedge languages. We show how linear systems of hedge language equations (LS for short) can be used as an intermediate representation on which to perform the computation of quotient, intersection, product derivative, and factor matrix of regular hedge languages. Regular hedge grammars and LSs are shown to be formalisms of same expressive power for the representation of hedge languages, and we give algorithms to convert between these two formalisms.
منابع مشابه
Residuated Skew Lattice with a Operation
In this paper, we define hedge operation on a residuated skew lattice and investigate some its properties. We get relationships between some special sets as dense, nilpotent, idempotent, regular elements sets and their hedges. By examples, we show that hedge of a dense element is not a dense and hedge of a regular element is not a regular. Also hedge of a nilpotent element is a nilpotent and h...
متن کاملLinear Systems for Regular Hedge Languages
We propose linear systems of hedge language equations (LSH) as a formalism to represent regular hedge languages. These linear systems are suitable for several computations in the algebra of regular hedge languages. We indicate algorithms to translate between representations by hedge automata and LSH, and for the computation of LSH for the intersection, quotient, left and right factors of regula...
متن کاملExtended Path Expressions for XML
Query languages for XML often use path expressions to locate elements in XML documents. Path expressions are regular expressions such that underlying alphabets represent conditions on nodes. Path expressions represent conditions on paths from the root, but do not represent conditions on siblings, siblings of ancestors, and descendants of such siblings. In order to capture such conditions, we pr...
متن کاملOn the Equivalence of Automata for KAT-expressions
Kleene algebra with tests (KAT) is a decidable equational system for program verification that uses both Kleene and Boolean algebras. In spite of KAT ’s elegance and success in providing theoretical solutions for several problems, not many efforts have been made towards obtaining tractable decision procedures that could be used in practical software verification tools. The main drawback of the ...
متن کاملAutomata for KAT Expressions
Kleene algebra with tests (KAT) is a decidable equational system for program verification, that uses both Kleene and Boolean algebras. In spite of KAT ’s elegance and success in providing theoretical solutions for several problems, not many efforts have been made towards obtaining tractable decision procedures that could be used in practical software verification tools. The main drawback of the...
متن کامل